Plasma actuator: influence of dielectric surface temperature

Plasma actuators have become the topic of interest of many researchers for the purpose of flow control. They have the advantage of manipulating the flow without the need for any moving parts, a small surface profile which does not disturb the free stream flow, and the ability to switch them on or off depending on the particular situation (active flow control). Due to these characteristics they are becoming very popular for flow control over aircraft wings. The objective of the current study is to examine the effect of the actuator surface temperature on its performance. This is an important topic to understand when dealing with real life aircraft equipped with plasma actuators. The temperature variations encountered during a flight envelope may have adverse effects in actuator performance. A peltier heater along with dry ice are used to alter the actuator temperature, while particle image velocimetry (PIV) is utilised to analyse the flow field. The results show a significant change in the induced flow field by the actuator as the surface temperature is varied. It is found that for a constant peak-to-peak voltage the maximum velocity produced by the actuator depends directly on the dielectric surface temperature. The findings suggest that by changing the actuator temperature the performance can be maintained or even altered at different environmental conditions

Aggregation of Votes with Multiple Positions on Each Issue

We consider the problem of aggregating votes cast by a society on a fixed set of issues, where each member of the society may vote for one of several positions on each issue, but the combination of votes on the various issues is restricted to a set of feasible voting patterns. We require the aggregation to be supportive, i.e. for every issue $j$ the corresponding component $f_j$ of every aggregator on every issue should satisfy $f_j(x_1, ,\ldots, x_n) \in \{x_1, ,\ldots, x_n\}$. We prove that, in such a set-up, non-dictatorial aggregation of votes in a society of some size is possible if and only if either non-dictatorial aggregation is possible in a society of only two members or a ternary aggregator exists that either on every issue $j$ is a majority operation, i.e. the corresponding component satisfies $f_j(x,x,y) = f_j(x,y,x) = f_j(y,x,x) =x, \forall x,y$, or on every issue is a minority operation, i.e. the corresponding component satisfies $f_j(x,x,y) = f_j(x,y,x) = f_j(y,x,x) =y, \forall x,y.$ We then introduce a notion of uniformly non-dictatorial aggregator, which is defined to be an aggregator that on every issue, and when restricted to an arbitrary two-element subset of the votes for that issue, differs from all projection functions. We first give a characterization of sets of feasible voting patterns that admit a uniformly non-dictatorial aggregator. Then making use of Bulatov's dichotomy theorem for conservative constraint satisfaction problems, we connect social choice theory with combinatorial complexity by proving that if a set of feasible voting patterns $X$ has a uniformly non-dictatorial aggregator of some arity then the multi-sorted conservative constraint satisfaction problem on $X$, in the sense introduced by Bulatov and Jeavons, with each issue representing a sort, is tractable; otherwise it is NP-complete

Verification of PCP-Related Computational Reductions in Coq

We formally verify several computational reductions concerning the Post correspondence problem (PCP) using the proof assistant Coq. Our verifications include a reduction of a string rewriting problem generalising the halting problem for Turing machines to PCP, and reductions of PCP to the intersection problem and the palindrome problem for context-free grammars. Interestingly, rigorous correctness proofs for some of the reductions are missing in the literature

Merging fragments of classical logic

We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More precisely, we will be interested in checking whether an axiomatization for Classical Propositional Logic may be produced by merging Hilbert-style calculi for two disjoint incomplete fragments of it. We will prove that the answer to that problem is a negative one, unless one of the components includes only top-like connectives.Comment: submitted to FroCoS 201

Generalized Satisfiability Problems via Operator Assignments

Schaefer introduced a framework for generalized satisfiability problems on the Boolean domain and characterized the computational complexity of such problems. We investigate an algebraization of Schaefer's framework in which the Fourier transform is used to represent constraints by multilinear polynomials in a unique way. The polynomial representation of constraints gives rise to a relaxation of the notion of satisfiability in which the values to variables are linear operators on some Hilbert space. For the case of constraints given by a system of linear equations over the two-element field, this relaxation has received considerable attention in the foundations of quantum mechanics, where such constructions as the Mermin-Peres magic square show that there are systems that have no solutions in the Boolean domain, but have solutions via operator assignments on some finite-dimensional Hilbert space. We obtain a complete characterization of the classes of Boolean relations for which there is a gap between satisfiability in the Boolean domain and the relaxation of satisfiability via operator assignments. To establish our main result, we adapt the notion of primitive-positive definability (pp-definability) to our setting, a notion that has been used extensively in the study of constraint satisfaction problems. Here, we show that pp-definability gives rise to gadget reductions that preserve satisfiability gaps. We also present several additional applications of this method. In particular and perhaps surprisingly, we show that the relaxed notion of pp-definability in which the quantified variables are allowed to range over operator assignments gives no additional expressive power in defining Boolean relations

Temporal Stream Logic: Synthesis beyond the Bools

Reactive systems that operate in environments with complex data, such as mobile apps or embedded controllers with many sensors, are difficult to synthesize. Synthesis tools usually fail for such systems because the state space resulting from the discretization of the data is too large. We introduce TSL, a new temporal logic that separates control and data. We provide a CEGAR-based synthesis approach for the construction of implementations that are guaranteed to satisfy a TSL specification for all possible instantiations of the data processing functions. TSL provides an attractive trade-off for synthesis. On the one hand, synthesis from TSL, unlike synthesis from standard temporal logics, is undecidable in general. On the other hand, however, synthesis from TSL is scalable, because it is independent of the complexity of the handled data. Among other benchmarks, we have successfully synthesized a music player Android app and a controller for an autonomous vehicle in the Open Race Car Simulator (TORCS.

Characterizations of quasitrivial symmetric nondecreasing associative operations

We provide a description of the class of n-ary operations on an arbitrary chain that are quasitrivial, symmetric, nondecreasing, and associative. We also prove that associativity can be replaced with bisymmetry in the definition of this class. Finally we investigate the special situation where the chain is finite

Associative polynomial functions over bounded distributive lattices

The associativity property, usually defined for binary functions, can be generalized to functions of a given fixed arity n>=1 as well as to functions of multiple arities. In this paper, we investigate these two generalizations in the case of polynomial functions over bounded distributive lattices and present explicit descriptions of the corresponding associative functions. We also show that, in this case, both generalizations of associativity are essentially the same.Comment: Final versio

On the Expressivity and Applicability of Model Representation Formalisms

A number of first-order calculi employ an explicit model representation formalism for automated reasoning and for detecting satisfiability. Many of these formalisms can represent infinite Herbrand models. The first-order fragment of monadic, shallow, linear, Horn (MSLH) clauses, is such a formalism used in the approximation refinement calculus. Our first result is a finite model property for MSLH clause sets. Therefore, MSLH clause sets cannot represent models of clause sets with inherently infinite models. Through a translation to tree automata, we further show that this limitation also applies to the linear fragments of implicit generalizations, which is the formalism used in the model-evolution calculus, to atoms with disequality constraints, the formalisms used in the non-redundant clause learning calculus (NRCL), and to atoms with membership constraints, a formalism used for example in decision procedures for algebraic data types. Although these formalisms cannot represent models of clause sets with inherently infinite models, through an additional approximation step they can. This is our second main result. For clause sets including the definition of an equivalence relation with the help of an additional, novel approximation, called reflexive relation splitting, the approximation refinement calculus can automatically show satisfiability through the MSLH clause set formalism.Comment: 15 page

Programmability of Chemical Reaction Networks

Motivated by the intriguing complexity of biochemical circuitry within individual cells we study Stochastic Chemical Reaction Networks (SCRNs), a formal model that considers a set of chemical reactions acting on a finite number of molecules in a well-stirred solution according to standard chemical kinetics equations. SCRNs have been widely used for describing naturally occurring (bio)chemical systems, and with the advent of synthetic biology they become a promising language for the design of artificial biochemical circuits. Our interest here is the computational power of SCRNs and how they relate to more conventional models of computation. We survey known connections and give new connections between SCRNs and Boolean Logic Circuits, Vector Addition Systems, Petri Nets, Gate Implementability, Primitive Recursive Functions, Register Machines, Fractran, and Turing Machines. A theme to these investigations is the thin line between decidable and undecidable questions about SCRN behavior